POINTS IN TECHNIC OF SEPARATING ANAEROBES
نویسندگان
چکیده
منابع مشابه
Separating Collections of Points in Euclidean Spaces
Given two disjoint convex sets A and B in Ed, a hyperplane h in Ed separates them if A lies on one of the half spaces defined by h while B lies on the complementary half space. Given a collection F of convex sets in Ed we say F is separated by a set of hyperplanes H if every pair of elements of F i s separated by some hyperplane of H. We deal here with the case that the convex sets are all poin...
متن کاملOn Separating Points by Lines
Given a set P of n points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate n points, picked randomly (and uniformly) in the unit square, is Θ̃(n), where Θ̃ hides polylogarithmic factors. In addition, we provide a fast approximation algorithm for computing the separa...
متن کاملSeparating Points by Parallel Hyperplanes - Characterization Problem
This paper deals with partitions of a discrete set S of points in a d-dimensional space, by h parallel hyperplanes. Such partitions are in a direct correspondence with multilinear threshold functions which appear in the theory of neural networks and multivalued logic. The characterization (encoding) problem is studied. We show that a unique characterization (encoding) of such multilinear partit...
متن کاملSeparating points by axis-parallel lines
We study the problem of separating n points in the plane, no two of whi h have the same xor yoordinate, using a minimum number of verti al and horizontal lines avoiding the points, so that ea h ell of the subdivision ontains at most one point. Extending previous NP-hardness results due to Freimer et al. we prove that this problem and some variants of it are APX-hard. We give a 2-approximation a...
متن کاملSeparating Bi-Chromatic Points by Parallel Lines
Given a 2-coloring of the vertices of a regular n-gon P , how many parallel lines are needed to separate the vertices into monochromatic subsets? We prove that bn/2c is a tight upper bound, and also provide anO(n log n) time algorithm to determine the direction that gives the minimum number of lines. If the polygon is a non-regular convex polygon, then n − 3 lines may be necessary, while n − 2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JAMA: The Journal of the American Medical Association
سال: 1918
ISSN: 0098-7484
DOI: 10.1001/jama.1918.02600130010005